Efficiency of Equilibria in Uniform Matroid Congestion Games

Network routing games, and more generally congestion games play a central role in algorithmic game theory, comparable to the role of the traveling salesman problem in combinatorial optimization. It is known that the price of anarchy is independent of the network topology for non-atomic congestion games. In other words, it is independent of the structure of the strategy spaces of the players, and for a ne cost functions it equals 4/3. In this paper, we show that the dependence of the price of anarchy on the network topology is considerably more intricate for atomic congestion games. More specifically, we consider congestion games with a ne cost functions where the strategy spaces of players are symmetric and equal to the set of bases of a k-uniform matroid. In this setting, we show that the price of anarchy is strictly larger than the price of anarchy for singleton strategy spaces where the latter is 4/3. As our main result we show that the price of anarchy can be bounded from above by 28/13 ¥ 2.15. This constitutes a substantial improvement over the price of anarchy bound 5/2, which is known to be tight for arbitrary network routing games with a ne cost functions. 1998 ACM Subject Classification C.2.1 Network Architecture and Design: Network topology F.2.2 Nonnumerical Algorithms and Problems: Computations on Discrete Structures I.2.1 Applications and Expert Systems: Games